Lp-norms, Log-barriers and Cramer transform in Optimization

We show that the Laplace approximation of a supremum by Lp-norms has interesting consequences in optimization. For instance, the logarithmic barrier functions (LBF) of a primal convex problem P and its dual appear naturally when using this simple approximation technique for the value function g of P or its Legendre-Fenchel conjugate. In addition, minimizing the LBF of the dual is just evaluating the Cramer transform of the Laplace approximation of g. Finally, this technique permits to sometimes define an explicit dual problem in cases when the Legendre-Fenchel conjugate of g cannot be derived explicitly from its definition

Predicting the outcome of renal transplantation

ObjectiveRenal transplantation has dramatically improved the survival rate of hemodialysis patients. However, with a growing proportion of marginal organs and improved immunosuppression, it is necessary to verify that the established allocation system, mostly based on human leukocyte antigen matching, still meets today's needs. The authors turn to machine-learning techniques to predict, from donor-recipient data, the estimated glomerular filtration rate (eGFR) of the recipient 1 year after transplantation.DesignThe patient's eGFR was predicted using donor-recipient characteristics available at the time of transplantation. Donors' data were obtained from Eurotransplant's database, while recipients' details were retrieved from Charite Campus Virchow-Klinikum's database. A total of 707 renal transplantations from cadaveric donors were included.MeasurementsTwo separate datasets were created, taking features with <10% missing values for one and <50% missing values for the other. Four established regressors were run on both datasets, with and without feature selection.ResultsThe authors obtained a Pearson correlation coefficient between predicted and real eGFR (COR) of 0.48. The best model for the dataset was a Gaussian support vector machine with recursive feature elimination on the more inclusive dataset. All results are available at http://transplant.molgen.mpg.de/.LimitationsFor now, missing values in the data must be predicted and filled in. The performance is not as high as hoped, but the dataset seems to be the main cause.ConclusionsPredicting the outcome is possible with the dataset at hand (COR=0.48). Valuable features include age and creatinine levels of the donor, as well as sex and weight of the recipient

The Ecosystem Approach to Fisheries: Issues, Terminology, Principles, Institutional Foundations, Implementation and Outlook

Ecosystems are complex and dynamic natural units that produce goods and services beyond those of benefit to fisheries. Because fisheries have a direct impact on the ecosystem, which is also impacted by other human activities, they need to be managed in an ecosystem context. The meaning of the terms 'ecosystem management', 'ecosystem based management', 'ecosystem approach to fisheries'(EAF), etc., are still not universally defined and progressively evolving. The justification of EAF is evident in the characteristics of an exploited ecosystem and the impacts resulting from fisheries and other activities. The rich set of international agreements of relevance to EAF contains a large number of principles and conceptual objectives. Both provide a fundamental guidance and a significant challenge for the implementation of EAF. The available international instruments also provide the institutional foundations for EAF. The FAO Code of Conduct for Responsible Fisheries is particularly important in this respect and contains provisions for practically all aspects of the approach. One major difficulty in defining EAF lies precisely in turning the available concepts and principles into operational objectives from which an EAF management plan would more easily be developed. The paper discusses these together with the types of action needed to achieve them. Experience in EAF implementation is still limited but some issues are already apparent, e.g. in added complexity, insufficient capacity, slow implementation, need for a pragmatic approach, etc. It is argued, in conclusion, that the future of EAF and fisheries depends on the way in which the two fundamental concepts of fisheries management and ecosystem management, and their respective stakeholders, will join efforts or collide

Certificates and relaxations for integer programming and the semi-group membership problem

We consider integer programming and the semi-group membership problem. We provide the following theorem of the alternative: the system Ax=b has no nonnegative integral solution x if and only if p(b) <0 for some given polynomial p whose vector of coefficients lies in a convex cone that we characterize. We also provide a hierarchy of linear programming relaxations, where the continuous case Ax=b with x real and nonnegative, describes the first relaxation in the hierarchy.Comment: 21 page

The Moment Problem for Continuous Positive Semidefinite Linear functionals

Let $\tau$ be a locally convex topology on the countable dimensional polynomial $\reals$-algebra \rx:=\reals[X_1,...,X_n]. Let $K$ be a closed subset of $\reals^n$, and let $M:=M_{\{g_1, ... g_s\}}$ be a finitely generated quadratic module in \rx. We investigate the following question: When is the cone \Pos(K) (of polynomials nonnegative on $K$) included in the closure of $M$? We give an interpretation of this inclusion with respect to representing continuous linear functionals by measures. We discuss several examples; we compute the closure of M=\sos with respect to weighted norm-$p$ topologies. We show that this closure coincides with the cone \Pos(K) where $K$ is a certain convex compact polyhedron.Comment: 14 page

A Proper Motion Survey for White Dwarfs with the Wide Field Planetary Camera 2

We have performed a search for halo white dwarfs as high proper motion objects in a second epoch WFPC2 image of the Groth-Westphal strip. We identify 24 high proper motion objects with mu > 0.014 ''/yr. Five of these high proper motion objects are identified as strong white dwarf candidates on the basis of their position in a reduced proper motion diagram. We create a model of the Milky Way thin disk, thick disk and stellar halo and find that this sample of white dwarfs is clearly an excess above the < 2 detections expected from these known stellar populations. The origin of the excess signal is less clear. Possibly, the excess cannot be explained without invoking a fourth galactic component: a white dwarf dark halo. We present a statistical separation of our sample into the four components and estimate the corresponding local white dwarf densities using only the directly observable variables, V, V-I, and mu. For all Galactic models explored, our sample separates into about 3 disk white dwarfs and 2 halo white dwarfs. However, the further subdivision into the thin and thick disk and the stellar and dark halo, and the subsequent calculation of the local densities are sensitive to the input parameters of our model for each Galactic component. Using the lowest mean mass model for the dark halo we find a 7% white dwarf halo and six times the canonical value for the thin disk white dwarf density (at marginal statistical significance), but possible systematic errors due to uncertainty in the model parameters likely dominate these statistical error bars. The white dwarf halo can be reduced to around 1.5% of the halo dark matter by changing the initial mass function slightly. The local thin disk white dwarf density in our solution can be made consistent with the canonical value by assuming a larger thin disk scaleheight of 500 pc.Comment: revised version, accepted by ApJ, results unchanged, discussion expande

Limitations of Algebraic Approaches to Graph Isomorphism Testing

We investigate the power of graph isomorphism algorithms based on algebraic reasoning techniques like Gr\"obner basis computation. The idea of these algorithms is to encode two graphs into a system of equations that are satisfiable if and only if if the graphs are isomorphic, and then to (try to) decide satisfiability of the system using, for example, the Gr\"obner basis algorithm. In some cases this can be done in polynomial time, in particular, if the equations admit a bounded degree refutation in an algebraic proof systems such as Nullstellensatz or polynomial calculus. We prove linear lower bounds on the polynomial calculus degree over all fields of characteristic different from 2 and also linear lower bounds for the degree of Positivstellensatz calculus derivations. We compare this approach to recently studied linear and semidefinite programming approaches to isomorphism testing, which are known to be related to the combinatorial Weisfeiler-Lehman algorithm. We exactly characterise the power of the Weisfeiler-Lehman algorithm in terms of an algebraic proof system that lies between degree-k Nullstellensatz and degree-k polynomial calculus